FACOPT: a user friendly FACility layout OPTimization system
نویسندگان
چکیده
The facility layout problem is a well researched one. However few effective and user friendly approaches have been proposed. Since it is an NP hard problem, various optimization approaches for small problems and heuristic approaches for the larger problems have been proposed. For the most part the more effective algorithms are not user friendly. On the other hand user friendly methods have not been effective in handling the intricacies such as unequal department sizes. In this research we present FACOPT, a heuristic approach that is effective and user friendly. The software uses two methods, Simulated Annealing and Genetic Algorithm to solve the facility layout problem. Computational tests are also done to identify good parameter values and to compare the performance of the two algorithms. Scope and Purpose Various methods have been proposed for facility layout where departments are laid out within a facility. However many of them are not flexible enough to handle intricacies such as unequal department sizes. Others do not provide user-friendly interfaces. Thus there is a need for user-friendly software incorporating effective and flexible procedures. In this research we present FACOPT, a heuristic approach that is effective and user friendly. The software uses two different approaches to solve the facility layout problem effectively. FACOPT has a Visual BASIC interface and runs under a Windows environment for ease of use.
منابع مشابه
Stochastic Facility Layout Planning Problem: A Metaheuristic and Case Study
Facility layout is one of the most important Operations Management problems due to its direct impact on the financial performance of both private and public firms. Facility layout problem (FLP) with stochastic parameters, unequal area facilities, and grid system modeling is named GSUA-STFLP. This problem has not been worked in the literature so that to solve GSUA-STFLP is our main contribution....
متن کاملApplications of two new algorithms of cuckoo optimization (CO) and forest optimization (FO) for solving single row facility layout problem (SRFLP)
Nowadays, due to inherent complexity of real optimization problems, it has always been a challenging issue to develop a solution algorithm to these problems. Single row facility layout problem (SRFLP) is a NP-hard problem of arranging a number of rectangular facilities with varying length on one side of a straight line with aim of minimizing the weighted sum of the distance between all facility...
متن کاملA Tunned-parameter Hybrid Algorithm for Dynamic Facility Layout Problem with Budget Constraint using GA and SAA
A facility layout problem is concerned with determining the best position of departments, cells, or machines on the plant. An efficient layout contributes to the overall efficiency of operations. It’s been proved that, when system characteristics change, it can cause a significant increase in material handling cost. Consequently, the efficiency of the current layout decreases or is lost and it ...
متن کاملA New Optimization via Invasive Weeds Algorithm for Dynamic Facility Layout Problem
The dynamic facility layout problem (DFLP) is the problem of finding positions of departments onthe plant floor for multiple periods (material flows between departments change during the planning horizon)such that departments do not overlap, and the sum of the material handling and rearrangement costs isminimized. In this paper a new optimization algorithm inspired from colonizing weeds, Invasi...
متن کاملA heuristic method for combined optimization of layout design and cluster configuration in continuous productions
Facility layout problems have been generally solved either hierarchically or integrated into other phases of plant design. In this paper, a hybrid method is introduced so that clustering and facilities layout can be simultaneously optimized. Each cluster is formed by a group of connected facilities and selection of the most appropriate cluster configuration is aimed. Since exact method by MIP i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computers & OR
دوره 30 شماره
صفحات -
تاریخ انتشار 2003